class Solution2 {
    public int searchInsert(int[] nums, int target) {
        int left=0;
        int right=nums.length-1;
        while(left<right) {
            int mid=left+(right-left)/2;
            if(nums[mid]<target) left=mid+1;
            else right=mid;
        }
        //特殊情况处理(第三种情况)
        if(nums[right]<target) return right+1;
        return right;
    }
}